Simulations of Weighted Tree Automata

Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, Noetherian semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations. More precisely, in all mentioned cases there exists a single wta that simulates both M and N. Those results immediately yield decidability of equivalence provided that the semiring is finitely (and effectively) presented.Comment: 17 pages, 2 figure

Kleene Algebra with Converse

International audienceThe equational theory generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure was studied by Bernátsky, Bloom, Ésik, and Stefanescu in 1995. We reformulate some of their proofs in syntactic and elementary terms, and we provide a new algorithm to decide the corresponding theory. This algorithm is both simpler and more efficient; it relies on an alternative automata construction, that allows us to prove that the considered equational theory lies in the complexity class PSPACE. Specific regular languages appear at various places in the proofs. Those proofs were made tractable by considering appropriate automata recognising those languages, and exploiting symmetries in those automata

Undirected Graphs of Entanglement Two

Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at most k. As this measure is defined by means of games, game theoretic ideas naturally lead to design polynomial algorithms that, for fixed k, decide the problem. Known characterizations of directed graphs of entanglement at most 1 lead, for k = 1, to design even faster algorithms. In this paper we present an explicit characterization of undirected graphs of entanglement at most 2. With such a characterization at hand, we devise a linear time algorithm to decide whether an undirected graph has this property

The impact of parent-created motivational climate on adolescent athletes' perceptions of physical self-concept

This is a preliminary version of this article. The official published version can be obtained from the link below.Grounded in expectancy-value model (Eccles, 1993) and achievement goal theory (Nicholls, 1989), this study examined the perceived parental climate and its impact on athletes' perceptions of competence and ability. Hierarchical regression analyses with a sample of 237 British adolescent athletes revealed that mothers and fathers' task- and ego-involving climate predicted their son's physical self-concept; the father in particular is the strongest influence in shaping a son's physical self-concept positively and negatively. It was also found that the self-concept of the young adolescent athlete is more strongly affected by the perceived parental-created motivational climate (both task and ego) than the older adolescent athlete's self-concept. These findings support the expectancy-value model assumptions related to the role of parents as important socializing agents, the existence of gender-stereotyping, and the heavy reliance younger children place on parents' feedback

Calculating Colimits Compositionally

We show how finite limits and colimits can be calculated compositionally using the algebras of spans and cospans, and give as an application a proof of the Kleene Theorem on regular languages

A semantical approach to equilibria and rationality

Game theoretic equilibria are mathematical expressions of rationality. Rational agents are used to model not only humans and their software representatives, but also organisms, populations, species and genes, interacting with each other and with the environment. Rational behaviors are achieved not only through conscious reasoning, but also through spontaneous stabilization at equilibrium points. Formal theories of rationality are usually guided by informal intuitions, which are acquired by observing some concrete economic, biological, or network processes. Treating such processes as instances of computation, we reconstruct and refine some basic notions of equilibrium and rationality from the some basic structures of computation. It is, of course, well known that equilibria arise as fixed points; the point is that semantics of computation of fixed points seems to be providing novel methods, algebraic and coalgebraic, for reasoning about them.Comment: 18 pages; Proceedings of CALCO 200

An infinitary model of linear logic

In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint operator Y as a Conway operator alternatively defined in an inductive or a coinductive way. We then extend the relational semantics with a notion of color or priority in the sense of parity games. This extension enables us to define a new fixpoint operator Y combining both inductive and coinductive policies. We conclude the paper by sketching the connection between the resulting model of lambda-calculus with recursion and higher-order model-checking.Comment: Accepted at Fossacs 201

Some Varieties of Equational Logic (Extended Abstract)

... been a major theme of Joseph Goguen’s research, perhaps even the major theme. One strand of this work concerns algebraic datatypes. Recently there has been some interest in what one may call algebraic computation types. As we will show, these are also given by equational theories, if one only understands the notion of equational logic in somewhat broader senses than usual. One moral of our work is that, suitably considered, equational logic is not tied to the usual first-order syntax of terms and equations. Standard equational logic has proved a useful tool in several branches of computer science, see, for example, the RTA conference series [9] and textbooks, such as [1]. Perhaps the possibilities for richer varieties of equational logic discussed here will lead to further applications. We begin with an explanation of computation types. Starting around 1989, Eugenio Moggi introduced the idea of monadic notions of computation [11, 12

On Kedlaya type inequalities for weighted means

In 2016 we proved that for every symmetric, repetition invariant and Jensen concave mean $\mathscr{M}$ the Kedlaya-type inequality $$\mathscr{A}\big(x_1,\mathscr{M}(x_1,x_2),\ldots,\mathscr{M}(x_1,\ldots,x_n)\big)\le \mathscr{M} \big(x_1, \mathscr{A}(x_1,x_2),\ldots,\mathscr{A}(x_1,\ldots,x_n)\big)$$ holds for an arbitrary $(x_n)$ ($\mathscr{A}$ stands for the arithmetic mean). We are going to prove the weighted counterpart of this inequality. More precisely, if $(x_n)$ is a vector with corresponding (non-normalized) weights $(\lambda_n)$ and $\mathscr{M}_{i=1}^n(x_i,\lambda_i)$ denotes the weighted mean then, under analogous conditions on $\mathscr{M}$, the inequality $$\mathscr{A}_{i=1}^n \big(\mathscr{M}_{j=1}^i (x_j,\lambda_j),\:\lambda_i\big) \le \mathscr{M}_{i=1}^n \big(\mathscr{A}_{j=1}^i (x_j,\lambda_j),\:\lambda_i\big)$$ holds for every $(x_n)$ and $(\lambda_n)$ such that the sequence $(\frac{\lambda_k}{\lambda_1+\cdots+\lambda_k})$ is decreasing.Comment: J. Inequal. Appl. (2018